greedy coloring造句

例句与造句

1. For a graph of maximum degree, any greedy coloring will use at most colors.
2. For an ordering with this property, the greedy coloring algorithm uses at most colors.
3. Thus, applying greedy coloring to a perfect ordering provides an efficient algorithm for optimally coloring chordal graphs.
4. Otherwise greedy coloring is a reasonable approximation, though it might not always get you the absolute best solution.
5. The upper bound, proved in Heawood's original short paper, is based on a greedy coloring algorithm.
6. It's difficult to find greedy coloring in a sentence. 用greedy coloring造句挺难的
7. There exists an ordering that leads to a greedy coloring with the optimal number of \ chi ( G ) colors.
8. Chordal graphs are perfectly orderable : an optimal coloring may be obtained by applying a greedy coloring algorithm to the vertices in the reverse of a perfect elimination ordering.
9. However, an approximation ratio of two can be achieved by a greedy coloring algorithm, because the chromatic number of a claw-free graph is greater than half its maximum degree.
10. More specifically, comparability graphs are perfectly orderable graphs, a subclass of perfect graphs : a greedy coloring algorithm for a topological ordering of a transitive orientation of the graph will optimally color them.
11. Indeed, for sparse graphs, the standard greedy coloring strategy of choosing the first available color achieves this competitive ratio, and it is possible to prove a matching lower bound on the competitive ratio of any online coloring algorithm.
12. On the other hand, greedy colorings can be arbitrarily bad; for example, the crown graph on " n " vertices can be 2-colored, but has an ordering that leads to a greedy coloring with n / 2 colors.
13. On the other hand, greedy colorings can be arbitrarily bad; for example, the crown graph on " n " vertices can be 2-colored, but has an ordering that leads to a greedy coloring with n / 2 colors.
14. A greedy coloring algorithm that considers the edges of a graph or multigraph one by one, assigning each edge the first available color, may sometimes use as many as colors, which may be nearly twice as many number of colors as is necessary.
15. For chordal graphs, and for special cases of chordal graphs such as interval graphs and indifference graphs, the greedy coloring algorithm can be used to find optimal colorings in polynomial time, by choosing the vertex ordering to be the reverse of a perfect elimination ordering for the graph.
16. The same property is true for a larger class of graphs, the distance-hereditary graphs : distance-hereditary graphs are perfectly orderable, with a perfect ordering given by the reverse of a lexicographic ordering, so lexicographic breadth-first search can be used in conjunction with greedy coloring algorithms to color them optimally in linear time.
更多例句：  下一页